Haris Aziz 0001
113 publications
12 venues
H Index 27
Affiliation
NICTA, SydneyUniversity of New South Wales, School of Computer Science and Engineering, Australia
TU Munich, Department of Informatics, Germany
University of Warwick, Department of Computer Science, UK
Links
| Name | Venue | Year | citations |
|---|---|---|---|
Fairness Concepts for Indivisible Items with Externalities.
|
AAAI | 2023 | 0 |
| Approval-Based Voting with Mixed Goods.
|
AAAI | 2023 | 0 |
| Fair Allocation of Two Types of Chores.
|
AAMAS | 2023 | 0 |
| Probabilistic Rationing with Categorized Priorities: Processing Reserves Fairly and Efficiently.
|
AAMAS | 2023 | 0 |
| Possible Fairness for Allocating Indivisible Resources.
|
AAMAS | 2023 | 0 |
| Group Fairness in Peer Review.
|
AAMAS | 2023 | 0 |
| Proportional Fairness in Obnoxious Facility Location.
|
AAMAS | 2023 | 0 |
| Best of Both Worlds Fairness under Entitlements.
|
AAMAS | 2023 | 0 |
| Matching Algorithms under Diversity-Based Reservations.
|
AAMAS | 2023 | 0 |
| Group Fairness in Peer Review.
|
NIPS/NeurIPS | 2023 | 0 |
| Fair division of indivisible goods: Recent progress and open questions.
|
Artificial Intelligence | 2023 | 0 |
| Portioning using ordinal preferences: Fairness and efficiency.
|
Artificial Intelligence | 2023 | 0 |
| Matching Market Design with Constraints.
|
AAAI | 2022 | 8 |
| Strategyproof and Proportionally Fair Facility Location.
|
WINE | 2022 | 0 |
| Random Rank: The One and Only Strategyproof and Proportionally Fair Randomized Facility Location Mechanism.
|
NIPS/NeurIPS | 2022 | 0 |
| Fair allocation of indivisible goods and chores.
|
Autonomous Agents and Multi-Agent Systems | 2022 | 0 |
| School Choice with Flexible Diversity Goals and Specialized Seats.
|
IJCAI | 2021 | 0 |
| Optimal Kidney Exchange with Immunosuppressants.
|
AAAI | 2021 | 2 |
| Participatory Funding Coordination: Model, Axioms and Rules.
|
ADT | 2021 | 3 |
| Obvious Manipulability of Voting Rules.
|
ADT | 2021 | 6 |
| Committee Selection using Attribute Approvals.
|
AAMAS | 2021 | 1 |
| Proportionally Representative Participatory Budgeting with Ordinal Preferences.
|
AAAI | 2021 | 0 |
| Achieving Envy-freeness and Equitability with Monetary Transfers.
|
AAAI | 2021 | 0 |
| Multi-Robot Task Allocation-Complexity and Approximation.
|
AAMAS | 2021 | 0 |
| Simultaneously Achieving Ex-ante and Ex-post Fairness.
|
WINE | 2020 | 18 |
| Mechanism Design for School Choice with Soft Diversity Constraints.
|
AAMAS | 2020 | 4 |
| Computing and testing Pareto optimal committees.
|
Autonomous Agents and Multi-Agent Systems | 2020 | 0 |
| Multiple Levels of Importance in Matching with Distributional Constraints: Extended Abstract.
|
AAMAS | 2020 | 1 |
| Summer Internship Matching with Funding Constraints.
|
AAMAS | 2020 | 8 |
| Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives.
|
AAAI | 2020 | 0 |
| Developments in Multi-Agent Fair Allocation.
|
AAAI | 2020 | 0 |
| The Temporary Exchange Problem.
|
AAMAS | 2020 | 0 |
| Strategyproof Multi-Item Exchange Under Single-Minded Dichotomous Preferences.
|
AAMAS | 2020 | 0 |
| Almost Group Envy-free Allocation of Indivisible Goods and Chores.
|
IJCAI | 2020 | 0 |
| Mechanism Design for School Choice with Soft Diversity Constraints.
|
IJCAI | 2020 | 0 |
| Fair Allocation with Diminishing Differences.
|
JAIR | 2020 | 0 |
| Strategyproof multi-item exchange under single-minded dichotomous preferences.
|
Autonomous Agents and Multi-Agent Systems | 2020 | 0 |
| Fair Allocation of Indivisible Goods and Chores.
|
IJCAI | 2019 | 76 |
| Pareto Optimal Allocation under Compact Uncertain Preferences.
|
AAAI | 2019 | 10 |
| From Matching with Diversity Constraints to Matching with Regional Quotas.
|
AAMAS | 2019 | 29 |
| Fair Online Allocation of Perishable Goods and its Application to Electric Vehicle Charging.
|
IJCAI | 2019 | 8 |
| Weighted Maxmin Fair Share Allocation of Indivisible Chores.
|
IJCAI | 2019 | 31 |
| Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity.
|
Artificial Intelligence | 2019 | 8 |
| Portioning Using Ordinal Preferences: Fairness and Efficiency.
|
IJCAI | 2019 | 24 |
| Maxmin Share Fair Allocation of Indivisible Chores to Asymmetric Agents.
|
AAMAS | 2019 | 10 |
| Strategyproof and Approximately Maxmin Fair Share Allocation of Chores.
|
IJCAI | 2019 | 17 |
| The Capacity Constrained Facility Location Problem.
|
WINE | 2019 | 0 |
| Strategyproof peer selection using randomization, partitioning, and apportionment.
|
Artificial Intelligence | 2019 | 0 |
| On the Complexity of Extended and Proportional Justified Representation.
|
AAAI | 2018 | 53 |
| Fixing balanced knockout and double elimination tournaments.
|
Artificial Intelligence | 2018 | 13 |
| Defender Stackelberg Game with Inverse Geodesic Length as Utility Metric.
|
AAMAS | 2018 | 6 |
| Egalitarian Committee Scoring Rules.
|
IJCAI | 2018 | 17 |
| Knowledge, Fairness, and Social Constraints.
|
AAAI | 2018 | 41 |
| Stability and Pareto Optimality in Refugee Allocation Matchings.
|
AAMAS | 2018 | 32 |
| Rank Maximal Equal Contribution: A Probabilistic Social Choice Function.
|
AAAI | 2018 | 0 |
| Proportionally Representative Participatory Budgeting: Axioms and Algorithms.
|
AAMAS | 2018 | 0 |
| Sub-committee Approval Voting and Generalized Justified Representation Axioms.
|
AIES | 2018 | 0 |
| Algorithms for Max-Min Share Fair Allocation of Indivisible Chores.
|
AAAI | 2017 | 76 |
| Fair Allocation based on Diminishing Differences.
|
IJCAI | 2017 | 6 |
| Stable Matching with Uncertain Pairwise Preferences.
|
AAMAS | 2017 | 25 |
| The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality.
|
IJCAI | 2017 | 45 |
| Equilibria in Sequential Allocation.
|
ADT | 2017 | 12 |
| Weakening Covert Networks by Minimizing Inverse Geodesic Length.
|
IJCAI | 2017 | 7 |
| Coalitional Exchange Stable Matchings in Marriage and Roommate Markets.
|
AAMAS | 2017 | 5 |
| Complexity of Manipulating Sequential Allocation.
|
AAAI | 2017 | 0 |
| Pareto Optimal Allocation under Uncertain Preferences.
|
AAMAS | 2017 | 0 |
| Pareto Optimal Allocation under Uncertain Preferences.
|
IJCAI | 2017 | 0 |
| Computational Social Choice: Some Current and New Directions.
|
IJCAI | 2016 | 17 |
| Egalitarianism of Random Assignment Mechanisms: (Extended Abstract).
|
AAMAS | 2016 | 5 |
| Control of Fair Division.
|
IJCAI | 2016 | 17 |
| Interdependent Scheduling Games.
|
IJCAI | 2016 | 4 |
| Computing Pareto Optimal Committees.
|
IJCAI | 2016 | 31 |
| Optimal Reallocation under Additive and Ordinal Preferences.
|
AAMAS | 2016 | 52 |
| Strategyproof Peer Selection: Mechanisms, Analyses, and Experiments.
|
AAAI | 2016 | 47 |
| Boolean Hedonic Games.
|
KR | 2016 | 0 |
| Welfare of Sequential Allocation Mechanisms for Indivisible Goods.
|
ECAI | 2016 | 0 |
| A Study of Proxies for Shapley Allocations of Transport Costs.
|
JAIR | 2016 | 0 |
| Manipulating the Probabilistic Serial Rule.
|
AAMAS | 2015 | 22 |
| Equilibria Under the Probabilistic Serial Rule.
|
IJCAI | 2015 | 19 |
| Online Fair Division: Analysing a Food Bank Problem.
|
IJCAI | 2015 | 102 |
| The Adjusted Winner Procedure: Characterizations and Equilibria.
|
IJCAI | 2015 | 6 |
| On the Susceptibility of the Deferred Acceptance Algorithm.
|
AAMAS | 2015 | 9 |
| Welfare Maximization in Fractional Hedonic Games.
|
IJCAI | 2015 | 35 |
| Ex post Efficiency of Random Assignments.
|
AAMAS | 2015 | 16 |
| Justified Representation in Approval-Based Committee Voting.
|
AAAI | 2015 | 0 |
| Computational Aspects of Multi-Winner Approval Voting.
|
AAMAS | 2015 | 0 |
| Possible and Necessary Allocations via Sequential Mechanisms.
|
IJCAI | 2015 | 0 |
| Possible and Necessary Winners of Partial Tournaments.
|
JAIR | 2015 | 0 |
| Fair assignment of indivisible objects under ordinal preferences.
|
Artificial Intelligence | 2015 | 0 |
| Fractional hedonic games.
|
AAMAS | 2014 | 113 |
| On the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice.
|
AAAI | 2014 | 41 |
| Fixing a Balanced Knockout Tournament.
|
AAAI | 2014 | 28 |
| A Generalization of Probabilistic Serial to Randomized Social Choice.
|
AAAI | 2014 | 39 |
| A note on the undercut procedure.
|
AAMAS | 2014 | 0 |
| Fair assignment of indivisible objects under ordinal preferences.
|
AAMAS | 2014 | 0 |
| Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations.
|
WINE | 2014 | 0 |
| The Computational Complexity of Random Serial Dictatorship.
|
WINE | 2013 | 79 |
| Maximal Recursive Rule: A New Social Decision Scheme.
|
IJCAI | 2013 | 22 |
| Ties Matter: Complexity of Manipulation when Tie-Breaking with a Random Vote.
|
AAAI | 2013 | 28 |
| On the tradeoff between economic efficiency and strategy proofness in randomized social choice.
|
AAMAS | 2013 | 65 |
| Stable marriage and roommate problems with individual-based stability.
|
AAMAS | 2013 | 0 |
| Computing desirable partitions in additively separable hedonic games.
|
Artificial Intelligence | 2013 | 0 |
| Possible and necessary winners of partial tournaments.
|
AAMAS | 2012 | 49 |
| Existence of stability in hedonic coalition formation games.
|
AAMAS | 2012 | 60 |
| Housing Markets with Indifferences: A Tale of Two Mechanisms.
|
AAAI | 2012 | 60 |
| Individual-based stability in hedonic games depending on the best or worst players.
|
AAMAS | 2012 | 0 |
| Complexity of coalition structure generation.
|
AAMAS | 2011 | 60 |
| Stable partitions in additively separable hedonic games.
|
AAMAS | 2011 | 60 |
| False-Name Manipulations in Weighted Voting Games.
|
JAIR | 2011 | 0 |
| Optimal Partitions in Additively Separable Hedonic Games.
|
IJCAI | 2011 | 16 |
| Monotone cooperative games and their threshold versions.
|
AAMAS | 2010 | 32 |
| False name manipulations in weighted voting games: splitting, merging and annexation.
|
AAMAS | 2009 | 33 |
| Wiretapping a Hidden Network.
|
WINE | 2009 | 22 |